In: Algorithms, 2021, vol. 14, no. 9, p. 25
Recent systems applying Machine Learning (ML) to solve the Traveling Salesman Problem (TSP) exhibit issues when they try to scale up to real case scenarios with several hundred vertices. The use of Candidate Lists (CLs) has been brought up to cope with the issues. A CL is defined as a subset of all the edges linked to a given vertex such that it contains mainly edges that are believed to be...
|
In: Designs, Codes and Cryptography, 2013, vol. 69, no. 1, p. 95-106
|
In: Computational Optimization and Applications, 2011, vol. 49, no. 1, p. 193-212
|
In: 4OR, 2005, vol. 3, no. 4, p. 315-328
|
In: Designs, Codes and Cryptography, 2012, vol. 63, no. 2, p. 241-253
|
In: Optimization and Engineering, 2012, vol. 13, no. 4, p. 705-726
|